Contexts as First-class Objects: an Implementation Based on the Sicstus Prolog System
نویسندگان
چکیده
This work provides a new view of contexts by defining them as primitives data types whose instances can be interpreted in two ways: as structured binding environments and as first-class objects. To achieve such a goal, an implementation is presented in which contexts are completely configured data structures, created by using the SICStus Prolog system support for modular programming. The main advantage of the implementation is to exploit the efficient indirect addressing scheme of SICStus Prolog in order to implement all the contextual binding mechanisms (late binding included) in a uniform way.
منابع مشابه
SICStus MT - Multithreaded Execution Environment for SICStus Prolog
We have designed and implemented a multithreaded execution environment for SICStus Prolog. The threads are dynamically managed using a small and compact set of Prolog primitives and they are implemented completely on user-level, requiring almost no support from the underlying operating system. The development of intelligent software agents has been one of the reasons why explicit concurrency ha...
متن کاملExtending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملDelay in the WAM and the TOAM: redoing a ten year old experiment
A 10 year old experiment related to freeze/2 and its implementation in B-Prolog and SICStus Prolog is redone. B-Prolog uses the TOAM abstract machine and its implementation of delayed goals is by means of suspension frames on the execution stack. The traditional WAM approach partly established by SICStus Prolog implementors is to put suspension terms on the heap. Earlier experiments comparing t...
متن کاملDemonstrating Prolog Usage: Building a Simple Game Program
To demonstrate the use of Prolog and how programming in Prolog is easy and efficient, this paper describe an implementation of the game booby-trap, a game similar to Minesweeper found on most personal computers with windows. Introduction Prolog (Programming in Logic) is a well known programming language in the field of Artificial Intelligence (AI). Although Prolog has much in common with Lisp (...
متن کاملIntelligent search strategies based on adaptive Constraint Handling Rules
The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP). This presentation compares an improved version of conflict-directed backjumping and two variants of dynamic backtracking with respect to chronological backtracking on some of the AIM insta...
متن کامل